TSTP Solution File: NUM659^4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM659^4 : TPTP v8.2.0. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 01:44:20 EDT 2024
% Result : Theorem 0.18s 0.50s
% Output : Refutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NUM659^4 : TPTP v8.2.0. Released v7.1.0.
% 0.10/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.10/0.32 % Computer : n003.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Mon May 20 04:34:37 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.10/0.32 This is a TH0_THM_EQU_NAR problem
% 0.10/0.32 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.35 % (30902)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.18/0.35 % (30900)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.18/0.35 % (30899)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.18/0.35 % (30903)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.18/0.35 % (30898)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (2999ds/27Mi)
% 0.18/0.35 % (30901)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.18/0.35 % (30896)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.18/0.35 % (30897)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.18/0.35 % (30899)Instruction limit reached!
% 0.18/0.35 % (30899)------------------------------
% 0.18/0.35 % (30899)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.35 % (30899)Termination reason: Unknown
% 0.18/0.35 % (30899)Termination phase: shuffling
% 0.18/0.35
% 0.18/0.35 % (30900)Instruction limit reached!
% 0.18/0.35 % (30900)------------------------------
% 0.18/0.35 % (30900)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.35 % (30900)Termination reason: Unknown
% 0.18/0.35 % (30900)Termination phase: shuffling
% 0.18/0.35
% 0.18/0.35 % (30900)Memory used [KB]: 1279
% 0.18/0.35 % (30900)Time elapsed: 0.003 s
% 0.18/0.35 % (30900)Instructions burned: 2 (million)
% 0.18/0.35 % (30900)------------------------------
% 0.18/0.35 % (30900)------------------------------
% 0.18/0.35 % (30899)Memory used [KB]: 1279
% 0.18/0.35 % (30899)Time elapsed: 0.003 s
% 0.18/0.35 % (30899)Instructions burned: 2 (million)
% 0.18/0.35 % (30899)------------------------------
% 0.18/0.35 % (30899)------------------------------
% 0.18/0.35 % (30903)Instruction limit reached!
% 0.18/0.35 % (30903)------------------------------
% 0.18/0.35 % (30903)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.35 % (30903)Termination reason: Unknown
% 0.18/0.35 % (30903)Termination phase: shuffling
% 0.18/0.35
% 0.18/0.35 % (30903)Memory used [KB]: 1279
% 0.18/0.35 % (30903)Time elapsed: 0.003 s
% 0.18/0.35 % (30903)Instructions burned: 3 (million)
% 0.18/0.35 % (30903)------------------------------
% 0.18/0.35 % (30903)------------------------------
% 0.18/0.35 % (30897)Instruction limit reached!
% 0.18/0.35 % (30897)------------------------------
% 0.18/0.35 % (30897)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.35 % (30897)Termination reason: Unknown
% 0.18/0.35 % (30897)Termination phase: shuffling
% 0.18/0.35
% 0.18/0.35 % (30897)Memory used [KB]: 1279
% 0.18/0.35 % (30897)Time elapsed: 0.004 s
% 0.18/0.35 % (30897)Instructions burned: 5 (million)
% 0.18/0.35 % (30897)------------------------------
% 0.18/0.35 % (30897)------------------------------
% 0.18/0.35 % (30902)Instruction limit reached!
% 0.18/0.35 % (30902)------------------------------
% 0.18/0.35 % (30902)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.36 % (30902)Termination reason: Unknown
% 0.18/0.36 % (30902)Termination phase: shuffling
% 0.18/0.36
% 0.18/0.36 % (30902)Memory used [KB]: 1535
% 0.18/0.36 % (30902)Time elapsed: 0.010 s
% 0.18/0.36 % (30902)Instructions burned: 18 (million)
% 0.18/0.36 % (30902)------------------------------
% 0.18/0.36 % (30902)------------------------------
% 0.18/0.36 % (30898)Instruction limit reached!
% 0.18/0.36 % (30898)------------------------------
% 0.18/0.36 % (30898)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.36 % (30898)Termination reason: Unknown
% 0.18/0.36 % (30898)Termination phase: Property scanning
% 0.18/0.36
% 0.18/0.36 % (30898)Memory used [KB]: 1535
% 0.18/0.36 % (30898)Time elapsed: 0.014 s
% 0.18/0.36 % (30898)Instructions burned: 29 (million)
% 0.18/0.36 % (30898)------------------------------
% 0.18/0.36 % (30898)------------------------------
% 0.18/0.36 % (30904)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.18/0.36 % (30905)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.18/0.36 % (30906)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.18/0.36 % (30906)Instruction limit reached!
% 0.18/0.36 % (30906)------------------------------
% 0.18/0.36 % (30906)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.36 % (30906)Termination reason: Unknown
% 0.18/0.36 % (30906)Termination phase: shuffling
% 0.18/0.36
% 0.18/0.36 % (30906)Memory used [KB]: 1279
% 0.18/0.36 % (30906)Time elapsed: 0.003 s
% 0.18/0.36 % (30906)Instructions burned: 3 (million)
% 0.18/0.36 % (30906)------------------------------
% 0.18/0.36 % (30906)------------------------------
% 0.18/0.36 % (30907)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on theBenchmark for (2999ds/1041Mi)
% 0.18/0.37 % (30901)Refutation not found, incomplete strategy
% 0.18/0.37 % (30901)------------------------------
% 0.18/0.37 % (30901)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.37 % (30901)Termination reason: Refutation not found, incomplete strategy
% 0.18/0.37
% 0.18/0.37
% 0.18/0.37 % (30901)Memory used [KB]: 6140
% 0.18/0.37 % (30901)Time elapsed: 0.020 s
% 0.18/0.37 % (30901)Instructions burned: 40 (million)
% 0.18/0.37 % (30901)------------------------------
% 0.18/0.37 % (30901)------------------------------
% 0.18/0.37 % (30905)Instruction limit reached!
% 0.18/0.37 % (30905)------------------------------
% 0.18/0.37 % (30905)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.37 % (30905)Termination reason: Unknown
% 0.18/0.37 % (30905)Termination phase: shuffling
% 0.18/0.37
% 0.18/0.37 % (30905)Memory used [KB]: 1535
% 0.18/0.37 % (30905)Time elapsed: 0.008 s
% 0.18/0.37 % (30905)Instructions burned: 16 (million)
% 0.18/0.37 % (30905)------------------------------
% 0.18/0.37 % (30905)------------------------------
% 0.18/0.37 % (30908)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.18/0.37 % (30908)Instruction limit reached!
% 0.18/0.37 % (30908)------------------------------
% 0.18/0.37 % (30908)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.37 % (30908)Termination reason: Unknown
% 0.18/0.37 % (30908)Termination phase: shuffling
% 0.18/0.37
% 0.18/0.37 % (30908)Memory used [KB]: 1407
% 0.18/0.37 % (30908)Time elapsed: 0.005 s
% 0.18/0.37 % (30908)Instructions burned: 8 (million)
% 0.18/0.37 % (30908)------------------------------
% 0.18/0.37 % (30908)------------------------------
% 0.18/0.37 % (30909)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.18/0.37 % (30910)lrs+21_1:1_au=on:cnfonf=off:fd=preordered:fe=off:fsr=off:hud=11:inj=on:kws=precedence:s2pl=no:sp=weighted_frequency:tgt=full:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.18/0.37 % (30904)Instruction limit reached!
% 0.18/0.37 % (30904)------------------------------
% 0.18/0.37 % (30904)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.37 % (30904)Termination reason: Unknown
% 0.18/0.37 % (30904)Termination phase: Property scanning
% 0.18/0.37
% 0.18/0.37 % (30904)Memory used [KB]: 1663
% 0.18/0.37 % (30904)Time elapsed: 0.016 s
% 0.18/0.37 % (30904)Instructions burned: 38 (million)
% 0.18/0.37 % (30904)------------------------------
% 0.18/0.37 % (30904)------------------------------
% 0.18/0.38 % (30910)Instruction limit reached!
% 0.18/0.38 % (30910)------------------------------
% 0.18/0.38 % (30910)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.38 % (30910)Termination reason: Unknown
% 0.18/0.38 % (30910)Termination phase: shuffling
% 0.18/0.38
% 0.18/0.38 % (30910)Memory used [KB]: 1279
% 0.18/0.38 % (30910)Time elapsed: 0.003 s
% 0.18/0.38 % (30910)Instructions burned: 3 (million)
% 0.18/0.38 % (30910)------------------------------
% 0.18/0.38 % (30910)------------------------------
% 0.18/0.38 % (30912)lrs+10_1:1_cnfonf=off:cs=on:hud=3:prag=on:sup=off:i=7:si=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.18/0.38 % (30911)lrs+2_1:1_apa=on:au=on:bd=preordered:cnfonf=off:cs=on:ixr=off:sos=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.18/0.38 % (30909)Instruction limit reached!
% 0.18/0.38 % (30909)------------------------------
% 0.18/0.38 % (30909)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.38 % (30909)Termination reason: Unknown
% 0.18/0.38 % (30909)Termination phase: shuffling
% 0.18/0.38
% 0.18/0.38 % (30909)Memory used [KB]: 1535
% 0.18/0.38 % (30909)Time elapsed: 0.008 s
% 0.18/0.38 % (30909)Instructions burned: 16 (million)
% 0.18/0.38 % (30909)------------------------------
% 0.18/0.38 % (30909)------------------------------
% 0.18/0.38 % (30911)Instruction limit reached!
% 0.18/0.38 % (30911)------------------------------
% 0.18/0.38 % (30911)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.38 % (30911)Termination reason: Unknown
% 0.18/0.38 % (30911)Termination phase: shuffling
% 0.18/0.38
% 0.18/0.38 % (30911)Memory used [KB]: 1279
% 0.18/0.38 % (30911)Time elapsed: 0.003 s
% 0.18/0.38 % (30911)Instructions burned: 3 (million)
% 0.18/0.38 % (30911)------------------------------
% 0.18/0.38 % (30911)------------------------------
% 0.18/0.38 % (30912)Instruction limit reached!
% 0.18/0.38 % (30912)------------------------------
% 0.18/0.38 % (30912)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.38 % (30912)Termination reason: Unknown
% 0.18/0.38 % (30912)Termination phase: shuffling
% 0.18/0.38
% 0.18/0.38 % (30912)Memory used [KB]: 1407
% 0.18/0.38 % (30912)Time elapsed: 0.005 s
% 0.18/0.38 % (30912)Instructions burned: 9 (million)
% 0.18/0.38 % (30912)------------------------------
% 0.18/0.38 % (30912)------------------------------
% 0.18/0.38 % (30913)dis+1002_1:1_add=large:cnfonf=lazy_pi_sigma_gen:fe=off:prag=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.18/0.38 % (30913)Instruction limit reached!
% 0.18/0.38 % (30913)------------------------------
% 0.18/0.38 % (30913)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.38 % (30913)Termination reason: Unknown
% 0.18/0.38 % (30913)Termination phase: shuffling
% 0.18/0.38
% 0.18/0.38 % (30913)Memory used [KB]: 1279
% 0.18/0.38 % (30913)Time elapsed: 0.003 s
% 0.18/0.38 % (30913)Instructions burned: 4 (million)
% 0.18/0.38 % (30913)------------------------------
% 0.18/0.38 % (30913)------------------------------
% 0.18/0.39 % (30914)dis+1004_1:1_cha=on:cs=on:fe=off:hud=1:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.18/0.39 % (30915)lrs+1002_1:1_anc=all_dependent:au=on:cbe=off:fde=unused:ntd=on:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.18/0.39 % (30914)Instruction limit reached!
% 0.18/0.39 % (30914)------------------------------
% 0.18/0.39 % (30914)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.39 % (30914)Termination reason: Unknown
% 0.18/0.39 % (30914)Termination phase: shuffling
% 0.18/0.39
% 0.18/0.39 % (30914)Memory used [KB]: 1279
% 0.18/0.39 % (30914)Time elapsed: 0.003 s
% 0.18/0.39 % (30914)Instructions burned: 4 (million)
% 0.18/0.39 % (30914)------------------------------
% 0.18/0.39 % (30914)------------------------------
% 0.18/0.39 % (30916)lrs+10_1:1_e2e=on:sd=1:sgt=8:ss=axioms:i=710:si=on:rtra=on_0 on theBenchmark for (2999ds/710Mi)
% 0.18/0.39 % (30917)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.18/0.39 % (30918)dis+1002_5:1_au=on:bd=off:e2e=on:fde=none:fs=off:fsr=off:sos=on:i=902:si=on:rtra=on_0 on theBenchmark for (2999ds/902Mi)
% 0.18/0.40 % (30917)Instruction limit reached!
% 0.18/0.40 % (30917)------------------------------
% 0.18/0.40 % (30917)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.40 % (30917)Termination reason: Unknown
% 0.18/0.40 % (30917)Termination phase: shuffling
% 0.18/0.40
% 0.18/0.40 % (30917)Memory used [KB]: 1407
% 0.18/0.40 % (30917)Time elapsed: 0.005 s
% 0.18/0.40 % (30917)Instructions burned: 8 (million)
% 0.18/0.40 % (30917)------------------------------
% 0.18/0.40 % (30917)------------------------------
% 0.18/0.40 % (30915)Instruction limit reached!
% 0.18/0.40 % (30915)------------------------------
% 0.18/0.40 % (30915)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.40 % (30915)Termination reason: Unknown
% 0.18/0.40 % (30915)Termination phase: shuffling
% 0.18/0.40
% 0.18/0.40 % (30915)Memory used [KB]: 1535
% 0.18/0.40 % (30915)Time elapsed: 0.010 s
% 0.18/0.40 % (30915)Instructions burned: 19 (million)
% 0.18/0.40 % (30915)------------------------------
% 0.18/0.40 % (30915)------------------------------
% 0.18/0.40 % (30919)dis+21_1:8_apa=on:cnfonf=off:fd=off:fsr=off:hud=0:ins=1:kws=inv_frequency:nwc=10.0:ss=axioms:st=5.0:i=21:si=on:rtra=on_0 on theBenchmark for (2999ds/21Mi)
% 0.18/0.40 % (30920)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on theBenchmark for (2999ds/5Mi)
% 0.18/0.40 % (30896)Instruction limit reached!
% 0.18/0.40 % (30896)------------------------------
% 0.18/0.40 % (30896)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.40 % (30896)Termination reason: Unknown
% 0.18/0.40 % (30896)Termination phase: Function definition elimination
% 0.18/0.40
% 0.18/0.40 % (30896)Memory used [KB]: 1918
% 0.18/0.40 % (30896)Time elapsed: 0.056 s
% 0.18/0.40 % (30896)Instructions burned: 185 (million)
% 0.18/0.40 % (30896)------------------------------
% 0.18/0.40 % (30896)------------------------------
% 0.18/0.40 % (30920)Instruction limit reached!
% 0.18/0.40 % (30920)------------------------------
% 0.18/0.40 % (30920)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.40 % (30920)Termination reason: Unknown
% 0.18/0.40 % (30920)Termination phase: shuffling
% 0.18/0.40
% 0.18/0.40 % (30920)Memory used [KB]: 1407
% 0.18/0.40 % (30920)Time elapsed: 0.004 s
% 0.18/0.40 % (30920)Instructions burned: 7 (million)
% 0.18/0.40 % (30920)------------------------------
% 0.18/0.40 % (30920)------------------------------
% 0.18/0.41 % (30919)Instruction limit reached!
% 0.18/0.41 % (30919)------------------------------
% 0.18/0.41 % (30919)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.41 % (30919)Termination reason: Unknown
% 0.18/0.41 % (30919)Termination phase: shuffling
% 0.18/0.41
% 0.18/0.41 % (30919)Memory used [KB]: 1535
% 0.18/0.41 % (30919)Time elapsed: 0.011 s
% 0.18/0.41 % (30919)Instructions burned: 22 (million)
% 0.18/0.41 % (30919)------------------------------
% 0.18/0.41 % (30919)------------------------------
% 0.18/0.41 % (30921)lrs+2_1:1_cnfonf=lazy_not_gen_be_off:cs=on:fe=off:hud=10:inj=on:ins=3:plsq=on:plsqc=1:sd=10:ss=axioms:tnu=1:i=6:si=on:rtra=on_0 on theBenchmark for (2999ds/6Mi)
% 0.18/0.41 % (30922)lrs+1002_1:128_au=on:c=on:fsr=off:piset=equals:i=377:si=on:rtra=on_0 on theBenchmark for (2999ds/377Mi)
% 0.18/0.41 % (30921)Instruction limit reached!
% 0.18/0.41 % (30921)------------------------------
% 0.18/0.41 % (30921)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.41 % (30921)Termination reason: Unknown
% 0.18/0.41 % (30921)Termination phase: shuffling
% 0.18/0.41
% 0.18/0.41 % (30921)Memory used [KB]: 1407
% 0.18/0.41 % (30921)Time elapsed: 0.004 s
% 0.18/0.41 % (30921)Instructions burned: 6 (million)
% 0.18/0.41 % (30921)------------------------------
% 0.18/0.41 % (30921)------------------------------
% 0.18/0.41 % (30924)lrs+10_1:1_cnfonf=lazy_not_be_gen:ntd=on:sp=const_min:ss=axioms:sup=off:i=19:si=on:rtra=on_0 on theBenchmark for (2999ds/19Mi)
% 0.18/0.41 % (30923)dis+1010_1:4_atotf=0.2:c=on:cbe=off:cnfonf=lazy_simp:fe=off:ins=2:ntd=on:s2a=on:s2at=5.0:sgt=5:ss=axioms:st=1.5:i=779:si=on:rtra=on_0 on theBenchmark for (2999ds/779Mi)
% 0.18/0.42 % (30925)lrs+1010_1:1_au=on:s2a=on:sd=1:sgt=50:ss=axioms:i=879:si=on:rtra=on_0 on theBenchmark for (2999ds/879Mi)
% 0.18/0.42 % (30924)Instruction limit reached!
% 0.18/0.42 % (30924)------------------------------
% 0.18/0.42 % (30924)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.42 % (30924)Termination reason: Unknown
% 0.18/0.42 % (30924)Termination phase: shuffling
% 0.18/0.42
% 0.18/0.42 % (30924)Memory used [KB]: 1535
% 0.18/0.42 % (30924)Time elapsed: 0.009 s
% 0.18/0.42 % (30924)Instructions burned: 20 (million)
% 0.18/0.42 % (30924)------------------------------
% 0.18/0.42 % (30924)------------------------------
% 0.18/0.42 % (30926)dis+1002_1:128_acc=on:er=filter:i=17:si=on:rtra=on_0 on theBenchmark for (2999ds/17Mi)
% 0.18/0.43 % (30918)Refutation not found, incomplete strategy
% 0.18/0.43 % (30918)------------------------------
% 0.18/0.43 % (30918)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.43 % (30918)Termination reason: Refutation not found, incomplete strategy
% 0.18/0.43
% 0.18/0.43
% 0.18/0.43 % (30918)Memory used [KB]: 6396
% 0.18/0.43 % (30918)Time elapsed: 0.032 s
% 0.18/0.43 % (30918)Instructions burned: 76 (million)
% 0.18/0.43 % (30918)------------------------------
% 0.18/0.43 % (30918)------------------------------
% 0.18/0.43 % (30926)Instruction limit reached!
% 0.18/0.43 % (30926)------------------------------
% 0.18/0.43 % (30926)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.43 % (30926)Termination reason: Unknown
% 0.18/0.43 % (30926)Termination phase: shuffling
% 0.18/0.43
% 0.18/0.43 % (30926)Memory used [KB]: 1535
% 0.18/0.43 % (30926)Time elapsed: 0.009 s
% 0.18/0.43 % (30926)Instructions burned: 18 (million)
% 0.18/0.43 % (30926)------------------------------
% 0.18/0.43 % (30926)------------------------------
% 0.18/0.43 % (30927)ott+21_1:1_apa=on:au=on:cnfonf=off:sos=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.18/0.44 % (30927)Instruction limit reached!
% 0.18/0.44 % (30927)------------------------------
% 0.18/0.44 % (30927)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.44 % (30927)Termination reason: Unknown
% 0.18/0.44 % (30927)Termination phase: shuffling
% 0.18/0.44
% 0.18/0.44 % (30927)Memory used [KB]: 1279
% 0.18/0.44 % (30927)Time elapsed: 0.003 s
% 0.18/0.44 % (30927)Instructions burned: 4 (million)
% 0.18/0.44 % (30927)------------------------------
% 0.18/0.44 % (30927)------------------------------
% 0.18/0.44 % (30928)lrs+1010_1:8_cnfonf=off:hud=1:inj=on:tnu=5:i=30:si=on:rtra=on_0 on theBenchmark for (2998ds/30Mi)
% 0.18/0.44 % (30929)dis+10_1:1_ixr=off:plsq=on:plsqc=1:plsqr=32,1:s2a=on:i=127:si=on:rtra=on_0 on theBenchmark for (2998ds/127Mi)
% 0.18/0.45 % (30930)lrs+1002_1:1_au=on:cbe=off:cnfonf=conj_eager:cond=on:hi=on:i=100:si=on:rtra=on_0 on theBenchmark for (2998ds/100Mi)
% 0.18/0.45 % (30928)Instruction limit reached!
% 0.18/0.45 % (30928)------------------------------
% 0.18/0.45 % (30928)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.45 % (30928)Termination reason: Unknown
% 0.18/0.45 % (30928)Termination phase: Property scanning
% 0.18/0.45
% 0.18/0.45 % (30928)Memory used [KB]: 1535
% 0.18/0.45 % (30928)Time elapsed: 0.014 s
% 0.18/0.45 % (30928)Instructions burned: 31 (million)
% 0.18/0.45 % (30928)------------------------------
% 0.18/0.45 % (30928)------------------------------
% 0.18/0.46 % (30931)dis+10_1:1_anc=none:cnfonf=lazy_gen:fd=preordered:fe=off:hud=10:ins=3:ixr=off:nwc=5.0:plsq=on:plsqc=1:plsqr=32,1:sp=const_frequency:uhcvi=on:i=3:si=on:rtra=on_0 on theBenchmark for (2998ds/3Mi)
% 0.18/0.47 % (30931)Instruction limit reached!
% 0.18/0.47 % (30931)------------------------------
% 0.18/0.47 % (30931)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.47 % (30931)Termination reason: Unknown
% 0.18/0.47 % (30931)Termination phase: shuffling
% 0.18/0.47
% 0.18/0.47 % (30931)Memory used [KB]: 1279
% 0.18/0.47 % (30931)Time elapsed: 0.004 s
% 0.18/0.47 % (30931)Instructions burned: 5 (million)
% 0.18/0.47 % (30931)------------------------------
% 0.18/0.47 % (30931)------------------------------
% 0.18/0.48 % (30932)lrs+10_8:1_au=on:avsq=on:e2e=on:ins=3:s2a=on:s2at=3.0:ss=axioms:i=20:si=on:rtra=on_0 on theBenchmark for (2998ds/20Mi)
% 0.18/0.48 % (30930)Instruction limit reached!
% 0.18/0.48 % (30930)------------------------------
% 0.18/0.48 % (30930)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.48 % (30930)Termination reason: Unknown
% 0.18/0.48 % (30930)Termination phase: Function definition elimination
% 0.18/0.48
% 0.18/0.48 % (30930)Memory used [KB]: 1918
% 0.18/0.48 % (30930)Time elapsed: 0.033 s
% 0.18/0.48 % (30930)Instructions burned: 101 (million)
% 0.18/0.48 % (30930)------------------------------
% 0.18/0.48 % (30930)------------------------------
% 0.18/0.49 % (30929)Instruction limit reached!
% 0.18/0.49 % (30929)------------------------------
% 0.18/0.49 % (30929)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.49 % (30929)Termination reason: Unknown
% 0.18/0.49 % (30929)Termination phase: Function definition elimination
% 0.18/0.49
% 0.18/0.49 % (30929)Memory used [KB]: 1791
% 0.18/0.49 % (30929)Time elapsed: 0.044 s
% 0.18/0.49 % (30929)Instructions burned: 128 (million)
% 0.18/0.49 % (30929)------------------------------
% 0.18/0.49 % (30929)------------------------------
% 0.18/0.49 % (30932)Instruction limit reached!
% 0.18/0.49 % (30932)------------------------------
% 0.18/0.49 % (30932)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.49 % (30932)Termination reason: Unknown
% 0.18/0.49 % (30932)Termination phase: shuffling
% 0.18/0.49
% 0.18/0.49 % (30932)Memory used [KB]: 1535
% 0.18/0.49 % (30932)Time elapsed: 0.011 s
% 0.18/0.49 % (30932)Instructions burned: 22 (million)
% 0.18/0.49 % (30932)------------------------------
% 0.18/0.49 % (30932)------------------------------
% 0.18/0.49 % (30925)First to succeed.
% 0.18/0.49 % (30933)dis+1002_1:1_cbe=off:hud=5:nm=4:plsq=on:plsqr=7,1:prag=on:sp=const_max:tnu=1:i=86:si=on:rtra=on_0 on theBenchmark for (2998ds/86Mi)
% 0.18/0.50 % (30925)Refutation found. Thanks to Tanya!
% 0.18/0.50 % SZS status Theorem for theBenchmark
% 0.18/0.50 % SZS output start Proof for theBenchmark
% 0.18/0.50 thf(func_def_0, type, is_of: $i > ($i > $o) > $o).
% 0.18/0.50 thf(func_def_2, type, all_of: ($i > $o) > ($i > $o) > $o).
% 0.18/0.50 thf(func_def_3, type, eps: ($i > $o) > $i).
% 0.18/0.50 thf(func_def_4, type, in: $i > $i > $o).
% 0.18/0.50 thf(func_def_5, type, d_Subq: $i > $i > $o).
% 0.18/0.50 thf(func_def_7, type, union: $i > $i).
% 0.18/0.50 thf(func_def_8, type, power: $i > $i).
% 0.18/0.50 thf(func_def_9, type, repl: $i > ($i > $i) > $i).
% 0.18/0.50 thf(func_def_10, type, d_Union_closed: $i > $o).
% 0.18/0.50 thf(func_def_11, type, d_Power_closed: $i > $o).
% 0.18/0.50 thf(func_def_12, type, d_Repl_closed: $i > $o).
% 0.18/0.50 thf(func_def_13, type, d_ZF_closed: $i > $o).
% 0.18/0.50 thf(func_def_14, type, univof: $i > $i).
% 0.18/0.50 thf(func_def_15, type, if: $o > $i > $i > $i).
% 0.18/0.50 thf(func_def_16, type, nIn: $i > $i > $o).
% 0.18/0.50 thf(func_def_17, type, d_UPair: $i > $i > $i).
% 0.18/0.50 thf(func_def_18, type, d_Sing: $i > $i).
% 0.18/0.50 thf(func_def_19, type, binunion: $i > $i > $i).
% 0.18/0.50 thf(func_def_20, type, famunion: $i > ($i > $i) > $i).
% 0.18/0.50 thf(func_def_21, type, d_Sep: $i > ($i > $o) > $i).
% 0.18/0.50 thf(func_def_22, type, d_ReplSep: $i > ($i > $o) > ($i > $i) > $i).
% 0.18/0.50 thf(func_def_23, type, setminus: $i > $i > $i).
% 0.18/0.50 thf(func_def_24, type, d_In_rec_G: ($i > ($i > $i) > $i) > $i > $i > $o).
% 0.18/0.50 thf(func_def_25, type, d_In_rec: ($i > ($i > $i) > $i) > $i > $i).
% 0.18/0.50 thf(func_def_26, type, ordsucc: $i > $i).
% 0.18/0.50 thf(func_def_27, type, nat_p: $i > $o).
% 0.18/0.50 thf(func_def_29, type, d_Inj1: $i > $i).
% 0.18/0.50 thf(func_def_30, type, d_Inj0: $i > $i).
% 0.18/0.50 thf(func_def_31, type, d_Unj: $i > $i).
% 0.18/0.50 thf(func_def_32, type, pair: $i > $i > $i).
% 0.18/0.50 thf(func_def_33, type, proj0: $i > $i).
% 0.18/0.50 thf(func_def_34, type, proj1: $i > $i).
% 0.18/0.50 thf(func_def_35, type, d_Sigma: $i > ($i > $i) > $i).
% 0.18/0.50 thf(func_def_36, type, setprod: $i > $i > $i).
% 0.18/0.50 thf(func_def_37, type, ap: $i > $i > $i).
% 0.18/0.50 thf(func_def_38, type, pair_p: $i > $o).
% 0.18/0.50 thf(func_def_39, type, d_Pi: $i > ($i > $i) > $i).
% 0.18/0.50 thf(func_def_40, type, imp: $o > $o > $o).
% 0.18/0.50 thf(func_def_41, type, d_not: $o > $o).
% 0.18/0.50 thf(func_def_42, type, wel: $o > $o).
% 0.18/0.50 thf(func_def_44, type, l_ec: $o > $o > $o).
% 0.18/0.50 thf(func_def_45, type, d_and: $o > $o > $o).
% 0.18/0.50 thf(func_def_46, type, l_or: $o > $o > $o).
% 0.18/0.50 thf(func_def_47, type, orec: $o > $o > $o).
% 0.18/0.50 thf(func_def_48, type, l_iff: $o > $o > $o).
% 0.18/0.50 thf(func_def_49, type, all: $i > ($i > $o) > $o).
% 0.18/0.50 thf(func_def_50, type, non: $i > ($i > $o) > $i > $o).
% 0.18/0.50 thf(func_def_51, type, l_some: $i > ($i > $o) > $o).
% 0.18/0.50 thf(func_def_52, type, or3: $o > $o > $o > $o).
% 0.18/0.50 thf(func_def_53, type, and3: $o > $o > $o > $o).
% 0.18/0.50 thf(func_def_54, type, ec3: $o > $o > $o > $o).
% 0.18/0.50 thf(func_def_55, type, orec3: $o > $o > $o > $o).
% 0.18/0.50 thf(func_def_56, type, e_is: $i > $i > $i > $o).
% 0.18/0.50 thf(func_def_57, type, amone: $i > ($i > $o) > $o).
% 0.18/0.50 thf(func_def_58, type, one: $i > ($i > $o) > $o).
% 0.18/0.50 thf(func_def_59, type, ind: $i > ($i > $o) > $i).
% 0.18/0.50 thf(func_def_60, type, injective: $i > $i > $i > $o).
% 0.18/0.50 thf(func_def_61, type, image: $i > $i > $i > $i > $o).
% 0.18/0.50 thf(func_def_62, type, tofs: $i > $i > $i > $i > $i).
% 0.18/0.50 thf(func_def_63, type, soft: $i > $i > $i > $i > $i).
% 0.18/0.50 thf(func_def_64, type, inverse: $i > $i > $i > $i).
% 0.18/0.50 thf(func_def_65, type, surjective: $i > $i > $i > $o).
% 0.18/0.50 thf(func_def_66, type, bijective: $i > $i > $i > $o).
% 0.18/0.50 thf(func_def_67, type, invf: $i > $i > $i > $i).
% 0.18/0.50 thf(func_def_68, type, inj_h: $i > $i > $i > $i > $i > $i).
% 0.18/0.50 thf(func_def_69, type, e_in: $i > ($i > $o) > $i > $i).
% 0.18/0.50 thf(func_def_70, type, out: $i > ($i > $o) > $i > $i).
% 0.18/0.50 thf(func_def_71, type, d_pair: $i > $i > $i > $i > $i).
% 0.18/0.50 thf(func_def_72, type, first: $i > $i > $i > $i).
% 0.18/0.50 thf(func_def_73, type, second: $i > $i > $i > $i).
% 0.18/0.50 thf(func_def_74, type, prop1: $o > $i > $i > $i > $i > $o).
% 0.18/0.50 thf(func_def_75, type, ite: $o > $i > $i > $i > $i).
% 0.18/0.50 thf(func_def_76, type, wissel_wa: $i > $i > $i > $i > $i).
% 0.18/0.50 thf(func_def_77, type, wissel_wb: $i > $i > $i > $i > $i).
% 0.18/0.50 thf(func_def_78, type, wissel: $i > $i > $i > $i).
% 0.18/0.50 thf(func_def_79, type, changef: $i > $i > $i > $i > $i > $i).
% 0.18/0.50 thf(func_def_80, type, r_ec: $o > $o > $o).
% 0.18/0.50 thf(func_def_81, type, esti: $i > $i > $i > $o).
% 0.18/0.50 thf(func_def_82, type, empty: $i > $i > $o).
% 0.18/0.50 thf(func_def_83, type, nonempty: $i > $i > $o).
% 0.18/0.50 thf(func_def_84, type, incl: $i > $i > $i > $o).
% 0.18/0.50 thf(func_def_85, type, st_disj: $i > $i > $i > $o).
% 0.18/0.50 thf(func_def_86, type, nissetprop: $i > $i > $i > $i > $o).
% 0.18/0.50 thf(func_def_87, type, unmore: $i > $i > $i > $i).
% 0.18/0.50 thf(func_def_88, type, ecelt: $i > ($i > $i > $o) > $i > $i).
% 0.18/0.50 thf(func_def_89, type, ecp: $i > ($i > $i > $o) > $i > $i > $o).
% 0.18/0.50 thf(func_def_90, type, anec: $i > ($i > $i > $o) > $i > $o).
% 0.18/0.50 thf(func_def_91, type, ect: $i > ($i > $i > $o) > $i).
% 0.18/0.50 thf(func_def_92, type, ectset: $i > ($i > $i > $o) > $i > $i).
% 0.18/0.50 thf(func_def_93, type, ectelt: $i > ($i > $i > $o) > $i > $i).
% 0.18/0.50 thf(func_def_94, type, ecect: $i > ($i > $i > $o) > $i > $i).
% 0.18/0.50 thf(func_def_95, type, fixfu: $i > ($i > $i > $o) > $i > $i > $o).
% 0.18/0.50 thf(func_def_96, type, d_10_prop1: $i > ($i > $i > $o) > $i > $i > $i > $i > $i > $o).
% 0.18/0.50 thf(func_def_97, type, prop2: $i > ($i > $i > $o) > $i > $i > $i > $i > $o).
% 0.18/0.50 thf(func_def_98, type, indeq: $i > ($i > $i > $o) > $i > $i > $i > $i).
% 0.18/0.50 thf(func_def_99, type, fixfu2: $i > ($i > $i > $o) > $i > $i > $o).
% 0.18/0.50 thf(func_def_100, type, d_11_i: $i > ($i > $i > $o) > $i > $i > $i > $i).
% 0.18/0.50 thf(func_def_101, type, indeq2: $i > ($i > $i > $o) > $i > $i > $i > $i > $i).
% 0.18/0.50 thf(func_def_103, type, n_is: $i > $i > $o).
% 0.18/0.50 thf(func_def_104, type, nis: $i > $i > $o).
% 0.18/0.50 thf(func_def_105, type, n_in: $i > $i > $o).
% 0.18/0.50 thf(func_def_106, type, n_some: ($i > $o) > $o).
% 0.18/0.50 thf(func_def_107, type, n_all: ($i > $o) > $o).
% 0.18/0.50 thf(func_def_108, type, n_one: ($i > $o) > $o).
% 0.18/0.50 thf(func_def_110, type, cond1: $i > $o).
% 0.18/0.50 thf(func_def_111, type, cond2: $i > $o).
% 0.18/0.50 thf(func_def_112, type, i1_s: ($i > $o) > $i).
% 0.18/0.50 thf(func_def_113, type, d_22_prop1: $i > $o).
% 0.18/0.50 thf(func_def_114, type, d_23_prop1: $i > $o).
% 0.18/0.50 thf(func_def_115, type, d_24_prop1: $i > $o).
% 0.18/0.50 thf(func_def_116, type, d_24_prop2: $i > $i > $o).
% 0.18/0.50 thf(func_def_117, type, prop3: $i > $i > $i > $o).
% 0.18/0.50 thf(func_def_118, type, prop4: $i > $o).
% 0.18/0.50 thf(func_def_119, type, d_24_g: $i > $i).
% 0.18/0.50 thf(func_def_120, type, plus: $i > $i).
% 0.18/0.50 thf(func_def_121, type, n_pl: $i > $i > $i).
% 0.18/0.50 thf(func_def_122, type, d_25_prop1: $i > $i > $i > $o).
% 0.18/0.50 thf(func_def_123, type, d_26_prop1: $i > $i > $o).
% 0.18/0.50 thf(func_def_124, type, d_27_prop1: $i > $i > $o).
% 0.18/0.50 thf(func_def_125, type, d_28_prop1: $i > $i > $i > $o).
% 0.18/0.50 thf(func_def_126, type, diffprop: $i > $i > $i > $o).
% 0.18/0.50 thf(func_def_127, type, d_29_ii: $i > $i > $o).
% 0.18/0.50 thf(func_def_128, type, iii: $i > $i > $o).
% 0.18/0.50 thf(func_def_129, type, d_29_prop1: $i > $i > $o).
% 0.18/0.50 thf(func_def_130, type, moreis: $i > $i > $o).
% 0.18/0.50 thf(func_def_131, type, lessis: $i > $i > $o).
% 0.18/0.50 thf(func_def_150, type, sK0: ($i > $o) > $i).
% 0.18/0.50 thf(func_def_154, type, sK4: $i > $i > $i > $i > $i).
% 0.18/0.50 thf(func_def_155, type, ph5: !>[X0: $tType]:(X0)).
% 0.18/0.50 thf(f1281,plain,(
% 0.18/0.50 $false),
% 0.18/0.50 inference(trivial_inequality_removal,[],[f1280])).
% 0.18/0.50 thf(f1280,plain,(
% 0.18/0.50 ($true = $false)),
% 0.18/0.50 inference(forward_demodulation,[],[f1279,f699])).
% 0.18/0.50 thf(f699,plain,(
% 0.18/0.50 ($false = (iii @ sK2 @ sK3))),
% 0.18/0.50 inference(not_proxy_clausification,[],[f698])).
% 0.18/0.50 thf(f698,plain,(
% 0.18/0.50 ($true = (~ (iii @ sK2 @ sK3)))),
% 0.18/0.50 inference(binary_proxy_clausification,[],[f696])).
% 0.18/0.50 thf(f696,plain,(
% 0.18/0.50 (((~ (iii @ sK2 @ sK3)) => (n_is @ sK2 @ sK3)) = $false)),
% 0.18/0.50 inference(not_proxy_clausification,[],[f695])).
% 0.18/0.50 thf(f695,plain,(
% 0.18/0.50 ((~ ((~ (iii @ sK2 @ sK3)) => (n_is @ sK2 @ sK3))) = $true)),
% 0.18/0.50 inference(binary_proxy_clausification,[],[f692])).
% 0.18/0.50 thf(f692,plain,(
% 0.18/0.50 ($false = ((~ ((~ (iii @ sK2 @ sK3)) => (n_is @ sK2 @ sK3))) => (n_some @ (diffprop @ sK2 @ sK3))))),
% 0.18/0.50 inference(binary_proxy_clausification,[],[f691])).
% 0.18/0.50 thf(f691,plain,(
% 0.18/0.50 ($false = ((is_of @ sK3 @ (^[Y0 : $i]: (in @ Y0 @ nat))) => ((~ ((~ (iii @ sK2 @ sK3)) => (n_is @ sK2 @ sK3))) => (n_some @ (diffprop @ sK2 @ sK3)))))),
% 0.18/0.50 inference(beta_eta_normalization,[],[f690])).
% 0.18/0.50 thf(f690,plain,(
% 0.18/0.50 ($false = ((^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => ((~ ((~ (iii @ sK2 @ Y0)) => (n_is @ sK2 @ Y0))) => (n_some @ (diffprop @ sK2 @ Y0))))) @ sK3))),
% 0.18/0.50 inference(sigma_clausification,[],[f688])).
% 0.18/0.50 thf(f688,plain,(
% 0.18/0.50 ((!! @ $i @ (^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => ((~ ((~ (iii @ sK2 @ Y0)) => (n_is @ sK2 @ Y0))) => (n_some @ (diffprop @ sK2 @ Y0)))))) = $false)),
% 0.18/0.50 inference(binary_proxy_clausification,[],[f687])).
% 0.18/0.50 thf(f687,plain,(
% 0.18/0.50 (((is_of @ sK2 @ (^[Y0 : $i]: (in @ Y0 @ nat))) => (!! @ $i @ (^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => ((~ ((~ (iii @ sK2 @ Y0)) => (n_is @ sK2 @ Y0))) => (n_some @ (diffprop @ sK2 @ Y0))))))) = $false)),
% 0.18/0.50 inference(beta_eta_normalization,[],[f686])).
% 0.18/0.50 thf(f686,plain,(
% 0.18/0.50 ($false = ((^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => (!! @ $i @ (^[Y1 : $i]: ((is_of @ Y1 @ (^[Y2 : $i]: (in @ Y2 @ nat))) => ((~ ((~ (iii @ Y0 @ Y1)) => (n_is @ Y0 @ Y1))) => (n_some @ (diffprop @ Y0 @ Y1)))))))) @ sK2))),
% 0.18/0.50 inference(sigma_clausification,[],[f685])).
% 0.18/0.50 thf(f685,plain,(
% 0.18/0.50 ($true != (!! @ $i @ (^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => (!! @ $i @ (^[Y1 : $i]: ((is_of @ Y1 @ (^[Y2 : $i]: (in @ Y2 @ nat))) => ((~ ((~ (iii @ Y0 @ Y1)) => (n_is @ Y0 @ Y1))) => (n_some @ (diffprop @ Y0 @ Y1))))))))))),
% 0.18/0.50 inference(boolean_simplification,[],[f684])).
% 0.18/0.50 thf(f684,plain,(
% 0.18/0.50 ($true != (!! @ $i @ (^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => (!! @ $i @ (^[Y1 : $i]: ((is_of @ Y1 @ (^[Y2 : $i]: (in @ Y2 @ nat))) => ((~ (((iii @ Y0 @ Y1) => $false) => (n_is @ Y0 @ Y1))) => (n_some @ (diffprop @ Y0 @ Y1))))))))))),
% 0.18/0.50 inference(boolean_simplification,[],[f683])).
% 0.18/0.50 thf(f683,plain,(
% 0.18/0.50 ($true != (!! @ $i @ (^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => (!! @ $i @ (^[Y1 : $i]: ((is_of @ Y1 @ (^[Y2 : $i]: (in @ Y2 @ nat))) => (((((iii @ Y0 @ Y1) => $false) => (n_is @ Y0 @ Y1)) => $false) => (n_some @ (diffprop @ Y0 @ Y1))))))))))),
% 0.18/0.50 inference(beta_eta_normalization,[],[f659])).
% 0.18/0.50 thf(f659,plain,(
% 0.18/0.50 ($true != ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((is_of @ Y2 @ Y0) => (Y1 @ Y2))))))) @ (^[Y0 : $i]: (in @ Y0 @ nat)) @ (^[Y0 : $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: (!! @ $i @ (^[Y3 : $i]: ((is_of @ Y3 @ Y1) => (Y2 @ Y3))))))) @ (^[Y1 : $i]: (in @ Y1 @ nat)) @ (^[Y1 : $i]: (((^[Y2 : $o]: ((^[Y3 : $o]: ((^[Y4 : $o]: (Y3 => Y4)))) @ Y2 @ $false)) @ ((^[Y2 : $i]: ((^[Y3 : $i]: ((^[Y4 : $o]: ((^[Y5 : $o]: ((^[Y6 : $o]: (Y5 => Y6)))) @ ((^[Y5 : $o]: ((^[Y6 : $o]: ((^[Y7 : $o]: (Y6 => Y7)))) @ Y5 @ $false)) @ Y4))) @ (iii @ Y2 @ Y3) @ (n_is @ Y2 @ Y3))))) @ Y0 @ Y1)) => ((^[Y2 : $i]: ((^[Y3 : $i]: (n_some @ (diffprop @ Y2 @ Y3))))) @ Y0 @ Y1)))))))),
% 0.18/0.50 inference(definition_unfolding,[],[f607,f567,f567,f624,f627,f602])).
% 0.18/0.50 thf(f602,plain,(
% 0.18/0.50 (d_29_ii = (^[Y0 : $i]: ((^[Y1 : $i]: (n_some @ (diffprop @ Y0 @ Y1))))))),
% 0.18/0.50 inference(cnf_transformation,[],[f333])).
% 0.18/0.50 thf(f333,plain,(
% 0.18/0.50 (d_29_ii = (^[Y0 : $i]: ((^[Y1 : $i]: (n_some @ (diffprop @ Y0 @ Y1))))))),
% 0.18/0.50 inference(fool_elimination,[],[f205])).
% 0.18/0.50 thf(f205,axiom,(
% 0.18/0.50 ((^[X0 : $i, X1 : $i] : (n_some @ (diffprop @ X0 @ X1))) = d_29_ii)),
% 0.18/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p',def_d_29_ii)).
% 0.18/0.50 thf(f627,plain,(
% 0.18/0.50 (lessis = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $o]: ((^[Y3 : $o]: ((^[Y4 : $o]: (Y3 => Y4)))) @ ((^[Y3 : $o]: ((^[Y4 : $o]: ((^[Y5 : $o]: (Y4 => Y5)))) @ Y3 @ $false)) @ Y2))) @ (iii @ Y0 @ Y1) @ (n_is @ Y0 @ Y1))))))),
% 0.18/0.50 inference(definition_unfolding,[],[f590,f625])).
% 0.18/0.50 thf(f625,plain,(
% 0.18/0.50 (l_or = (^[Y0 : $o]: ((^[Y1 : $o]: ((^[Y2 : $o]: (Y1 => Y2)))) @ ((^[Y1 : $o]: ((^[Y2 : $o]: ((^[Y3 : $o]: (Y2 => Y3)))) @ Y1 @ $false)) @ Y0))))),
% 0.18/0.50 inference(definition_unfolding,[],[f581,f570,f624])).
% 0.18/0.50 thf(f570,plain,(
% 0.18/0.50 (imp = (^[Y0 : $o]: ((^[Y1 : $o]: (Y0 => Y1)))))),
% 0.18/0.50 inference(cnf_transformation,[],[f478])).
% 0.18/0.50 thf(f478,plain,(
% 0.18/0.50 (imp = (^[Y0 : $o]: ((^[Y1 : $o]: (Y0 => Y1)))))),
% 0.18/0.50 inference(fool_elimination,[],[f477])).
% 0.18/0.50 thf(f477,plain,(
% 0.18/0.50 ((^[X0 : $o, X1 : $o] : (X0 => X1)) = imp)),
% 0.18/0.50 inference(rectify,[],[f74])).
% 0.18/0.50 thf(f74,axiom,(
% 0.18/0.50 ((^[X0 : $o, X1 : $o] : (X0 => X1)) = imp)),
% 0.18/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p',def_imp)).
% 0.18/0.50 thf(f581,plain,(
% 0.18/0.50 (l_or = (^[Y0 : $o]: (imp @ (d_not @ Y0))))),
% 0.18/0.50 inference(cnf_transformation,[],[f403])).
% 0.18/0.50 thf(f403,plain,(
% 0.18/0.50 (l_or = (^[Y0 : $o]: (imp @ (d_not @ Y0))))),
% 0.18/0.50 inference(fool_elimination,[],[f81])).
% 0.18/0.50 thf(f81,axiom,(
% 0.18/0.50 (l_or = (^[X0 : $o] : (imp @ (d_not @ X0))))),
% 0.18/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p',def_l_or)).
% 0.18/0.50 thf(f590,plain,(
% 0.18/0.50 (lessis = (^[Y0 : $i]: ((^[Y1 : $i]: (l_or @ (iii @ Y0 @ Y1) @ (n_is @ Y0 @ Y1))))))),
% 0.18/0.50 inference(cnf_transformation,[],[f433])).
% 0.18/0.50 thf(f433,plain,(
% 0.18/0.50 (lessis = (^[Y0 : $i]: ((^[Y1 : $i]: (l_or @ (iii @ Y0 @ Y1) @ (n_is @ Y0 @ Y1))))))),
% 0.18/0.50 inference(fool_elimination,[],[f217])).
% 0.18/0.50 thf(f217,axiom,(
% 0.18/0.50 ((^[X0 : $i, X1 : $i] : (l_or @ (iii @ X0 @ X1) @ (n_is @ X0 @ X1))) = lessis)),
% 0.18/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p',def_lessis)).
% 0.18/0.50 thf(f624,plain,(
% 0.18/0.50 (d_not = (^[Y0 : $o]: ((^[Y1 : $o]: ((^[Y2 : $o]: (Y1 => Y2)))) @ Y0 @ $false)))),
% 0.18/0.50 inference(definition_unfolding,[],[f617,f570])).
% 0.18/0.50 thf(f617,plain,(
% 0.18/0.50 (d_not = (^[Y0 : $o]: (imp @ Y0 @ $false)))),
% 0.18/0.50 inference(cnf_transformation,[],[f235])).
% 0.18/0.50 thf(f235,plain,(
% 0.18/0.50 (d_not = (^[Y0 : $o]: (imp @ Y0 @ $false)))),
% 0.18/0.50 inference(fool_elimination,[],[f75])).
% 0.18/0.50 thf(f75,axiom,(
% 0.18/0.50 ((^[X0 : $o] : (imp @ X0 @ $false)) = d_not)),
% 0.18/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p',def_d_not)).
% 0.18/0.50 thf(f567,plain,(
% 0.18/0.50 (all_of = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((is_of @ Y2 @ Y0) => (Y1 @ Y2))))))))),
% 0.18/0.50 inference(cnf_transformation,[],[f453])).
% 0.18/0.50 thf(f453,plain,(
% 0.18/0.50 (all_of = (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((is_of @ Y2 @ Y0) => (Y1 @ Y2))))))))),
% 0.18/0.50 inference(fool_elimination,[],[f452])).
% 0.18/0.50 thf(f452,plain,(
% 0.18/0.50 ((^[X0 : $i > $o, X1 : $i > $o] : (! [X2] : ((is_of @ X2 @ X0) => (X1 @ X2)))) = all_of)),
% 0.18/0.50 inference(rectify,[],[f2])).
% 0.18/0.50 thf(f2,axiom,(
% 0.18/0.50 ((^[X0 : $i > $o, X1 : $i > $o] : (! [X2] : ((is_of @ X2 @ X0) => (X1 @ X2)))) = all_of)),
% 0.18/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p',def_all_of)).
% 0.18/0.50 thf(f607,plain,(
% 0.18/0.50 ((all_of @ (^[Y0 : $i]: (in @ Y0 @ nat)) @ (^[Y0 : $i]: (all_of @ (^[Y1 : $i]: (in @ Y1 @ nat)) @ (^[Y1 : $i]: ((d_not @ (lessis @ Y0 @ Y1)) => (d_29_ii @ Y0 @ Y1)))))) != $true)),
% 0.18/0.50 inference(cnf_transformation,[],[f561])).
% 0.18/0.50 thf(f561,plain,(
% 0.18/0.50 ((all_of @ (^[Y0 : $i]: (in @ Y0 @ nat)) @ (^[Y0 : $i]: (all_of @ (^[Y1 : $i]: (in @ Y1 @ nat)) @ (^[Y1 : $i]: ((d_not @ (lessis @ Y0 @ Y1)) => (d_29_ii @ Y0 @ Y1)))))) != $true)),
% 0.18/0.50 inference(flattening,[],[f239])).
% 0.18/0.50 thf(f239,plain,(
% 0.18/0.50 ~((all_of @ (^[Y0 : $i]: (in @ Y0 @ nat)) @ (^[Y0 : $i]: (all_of @ (^[Y1 : $i]: (in @ Y1 @ nat)) @ (^[Y1 : $i]: ((d_not @ (lessis @ Y0 @ Y1)) => (d_29_ii @ Y0 @ Y1)))))) = $true)),
% 0.18/0.50 inference(fool_elimination,[],[f238])).
% 0.18/0.50 thf(f238,plain,(
% 0.18/0.50 ~(all_of @ (^[X0 : $i] : (in @ X0 @ nat)) @ (^[X1 : $i] : (all_of @ (^[X2 : $i] : (in @ X2 @ nat)) @ (^[X3 : $i] : ((d_not @ (lessis @ X1 @ X3)) => (d_29_ii @ X1 @ X3))))))),
% 0.18/0.50 inference(rectify,[],[f228])).
% 0.18/0.50 thf(f228,negated_conjecture,(
% 0.18/0.50 ~(all_of @ (^[X0 : $i] : (in @ X0 @ nat)) @ (^[X0 : $i] : (all_of @ (^[X1 : $i] : (in @ X1 @ nat)) @ (^[X1 : $i] : ((d_not @ (lessis @ X0 @ X1)) => (d_29_ii @ X0 @ X1))))))),
% 0.18/0.50 inference(negated_conjecture,[],[f227])).
% 0.18/0.50 thf(f227,conjecture,(
% 0.18/0.50 (all_of @ (^[X0 : $i] : (in @ X0 @ nat)) @ (^[X0 : $i] : (all_of @ (^[X1 : $i] : (in @ X1 @ nat)) @ (^[X1 : $i] : ((d_not @ (lessis @ X0 @ X1)) => (d_29_ii @ X0 @ X1))))))),
% 0.18/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz10k)).
% 0.18/0.50 thf(f1279,plain,(
% 0.18/0.50 ($true = (iii @ sK2 @ sK3))),
% 0.18/0.50 inference(trivial_inequality_removal,[],[f1278])).
% 0.18/0.50 thf(f1278,plain,(
% 0.18/0.50 ($true = $false) | ($true = (iii @ sK2 @ sK3))),
% 0.18/0.50 inference(forward_demodulation,[],[f1277,f697])).
% 0.18/0.50 thf(f697,plain,(
% 0.18/0.50 ($false = (n_is @ sK2 @ sK3))),
% 0.18/0.50 inference(binary_proxy_clausification,[],[f696])).
% 0.18/0.50 thf(f1277,plain,(
% 0.18/0.50 ($true = (n_is @ sK2 @ sK3)) | ($true = (iii @ sK2 @ sK3))),
% 0.18/0.50 inference(trivial_inequality_removal,[],[f1276])).
% 0.18/0.50 thf(f1276,plain,(
% 0.18/0.50 ($true = $false) | ($true = (iii @ sK2 @ sK3)) | ($true = (n_is @ sK2 @ sK3))),
% 0.18/0.50 inference(forward_demodulation,[],[f1275,f1145])).
% 0.18/0.50 thf(f1145,plain,(
% 0.18/0.50 ($true = (n_is @ sK3 @ sK2))),
% 0.18/0.50 inference(trivial_inequality_removal,[],[f1144])).
% 0.18/0.50 thf(f1144,plain,(
% 0.18/0.50 ($true = $false) | ($true = (n_is @ sK3 @ sK2))),
% 0.18/0.50 inference(forward_demodulation,[],[f1143,f1093])).
% 0.18/0.50 thf(f1093,plain,(
% 0.18/0.50 ((n_some @ (diffprop @ sK3 @ sK2)) = $false)),
% 0.18/0.50 inference(trivial_inequality_removal,[],[f1092])).
% 0.18/0.50 thf(f1092,plain,(
% 0.18/0.50 ((n_some @ (diffprop @ sK3 @ sK2)) = $false) | ($true = $false)),
% 0.18/0.50 inference(forward_demodulation,[],[f1088,f699])).
% 0.18/0.50 thf(f1088,plain,(
% 0.18/0.50 ((n_some @ (diffprop @ sK3 @ sK2)) = $false) | ($true = (iii @ sK2 @ sK3))),
% 0.18/0.50 inference(trivial_inequality_removal,[],[f1085])).
% 0.18/0.50 thf(f1085,plain,(
% 0.18/0.50 ($true = (iii @ sK2 @ sK3)) | ($true = $false) | ((n_some @ (diffprop @ sK3 @ sK2)) = $false)),
% 0.18/0.50 inference(superposition,[],[f693,f1005])).
% 0.18/0.50 thf(f1005,plain,(
% 0.18/0.50 ( ! [X0 : $i] : (((is_of @ X0 @ (^[Y0 : $i]: (in @ Y0 @ nat))) = $false) | ($false = (n_some @ (diffprop @ X0 @ sK2))) | ($true = (iii @ sK2 @ X0))) )),
% 0.18/0.50 inference(trivial_inequality_removal,[],[f1001])).
% 0.18/0.50 thf(f1001,plain,(
% 0.18/0.50 ( ! [X0 : $i] : (((is_of @ X0 @ (^[Y0 : $i]: (in @ Y0 @ nat))) = $false) | ($true = $false) | ($false = (n_some @ (diffprop @ X0 @ sK2))) | ($true = (iii @ sK2 @ X0))) )),
% 0.18/0.50 inference(superposition,[],[f689,f964])).
% 0.18/0.50 thf(f964,plain,(
% 0.18/0.50 ( ! [X2 : $i,X1 : $i] : (($false = (is_of @ X2 @ (^[Y0 : $i]: (in @ Y0 @ nat)))) | ($false = (n_some @ (diffprop @ X1 @ X2))) | ($true = (iii @ X2 @ X1)) | ($false = (is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat))))) )),
% 0.18/0.50 inference(binary_proxy_clausification,[],[f963])).
% 0.18/0.50 thf(f963,plain,(
% 0.18/0.50 ( ! [X2 : $i,X1 : $i] : (($false = (is_of @ X2 @ (^[Y0 : $i]: (in @ Y0 @ nat)))) | ($false = (is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat)))) | ($true = ((n_some @ (diffprop @ X1 @ X2)) => (iii @ X2 @ X1)))) )),
% 0.18/0.50 inference(binary_proxy_clausification,[],[f962])).
% 0.18/0.50 thf(f962,plain,(
% 0.18/0.50 ( ! [X2 : $i,X1 : $i] : (($false = (is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat)))) | (((is_of @ X2 @ (^[Y0 : $i]: (in @ Y0 @ nat))) => ((n_some @ (diffprop @ X1 @ X2)) => (iii @ X2 @ X1))) = $true)) )),
% 0.18/0.50 inference(beta_eta_normalization,[],[f961])).
% 0.18/0.50 thf(f961,plain,(
% 0.18/0.50 ( ! [X2 : $i,X1 : $i] : (($false = (is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat)))) | ($true = ((^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => ((n_some @ (diffprop @ X1 @ Y0)) => (iii @ Y0 @ X1)))) @ X2))) )),
% 0.18/0.50 inference(pi_clausification,[],[f960])).
% 0.18/0.50 thf(f960,plain,(
% 0.18/0.50 ( ! [X1 : $i] : (($false = (is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat)))) | ($true = (!! @ $i @ (^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => ((n_some @ (diffprop @ X1 @ Y0)) => (iii @ Y0 @ X1))))))) )),
% 0.18/0.50 inference(binary_proxy_clausification,[],[f959])).
% 0.18/0.50 thf(f959,plain,(
% 0.18/0.50 ( ! [X1 : $i] : (($true = ((is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat))) => (!! @ $i @ (^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => ((n_some @ (diffprop @ X1 @ Y0)) => (iii @ Y0 @ X1)))))))) )),
% 0.18/0.50 inference(beta_eta_normalization,[],[f958])).
% 0.18/0.50 thf(f958,plain,(
% 0.18/0.50 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => (!! @ $i @ (^[Y1 : $i]: ((is_of @ Y1 @ (^[Y2 : $i]: (in @ Y2 @ nat))) => ((n_some @ (diffprop @ Y0 @ Y1)) => (iii @ Y1 @ Y0))))))) @ X1))) )),
% 0.18/0.50 inference(pi_clausification,[],[f957])).
% 0.18/0.50 thf(f957,plain,(
% 0.18/0.50 ($true = (!! @ $i @ (^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => (!! @ $i @ (^[Y1 : $i]: ((is_of @ Y1 @ (^[Y2 : $i]: (in @ Y2 @ nat))) => ((n_some @ (diffprop @ Y0 @ Y1)) => (iii @ Y1 @ Y0)))))))))),
% 0.18/0.50 inference(beta_eta_normalization,[],[f655])).
% 0.18/0.50 thf(f655,plain,(
% 0.18/0.50 (((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((is_of @ Y2 @ Y0) => (Y1 @ Y2))))))) @ (^[Y0 : $i]: (in @ Y0 @ nat)) @ (^[Y0 : $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: (!! @ $i @ (^[Y3 : $i]: ((is_of @ Y3 @ Y1) => (Y2 @ Y3))))))) @ (^[Y1 : $i]: (in @ Y1 @ nat)) @ (^[Y1 : $i]: (((^[Y2 : $i]: ((^[Y3 : $i]: (n_some @ (diffprop @ Y2 @ Y3))))) @ Y0 @ Y1) => (iii @ Y1 @ Y0)))))) = $true)),
% 0.18/0.50 inference(definition_unfolding,[],[f601,f567,f567,f602])).
% 0.18/0.50 thf(f601,plain,(
% 0.18/0.50 ($true = (all_of @ (^[Y0 : $i]: (in @ Y0 @ nat)) @ (^[Y0 : $i]: (all_of @ (^[Y1 : $i]: (in @ Y1 @ nat)) @ (^[Y1 : $i]: ((d_29_ii @ Y0 @ Y1) => (iii @ Y1 @ Y0)))))))),
% 0.18/0.50 inference(cnf_transformation,[],[f318])).
% 0.18/0.50 thf(f318,plain,(
% 0.18/0.50 ($true = (all_of @ (^[Y0 : $i]: (in @ Y0 @ nat)) @ (^[Y0 : $i]: (all_of @ (^[Y1 : $i]: (in @ Y1 @ nat)) @ (^[Y1 : $i]: ((d_29_ii @ Y0 @ Y1) => (iii @ Y1 @ Y0)))))))),
% 0.18/0.50 inference(fool_elimination,[],[f317])).
% 0.18/0.50 thf(f317,plain,(
% 0.18/0.50 (all_of @ (^[X0 : $i] : (in @ X0 @ nat)) @ (^[X1 : $i] : (all_of @ (^[X2 : $i] : (in @ X2 @ nat)) @ (^[X3 : $i] : ((d_29_ii @ X1 @ X3) => (iii @ X3 @ X1))))))),
% 0.18/0.50 inference(rectify,[],[f214])).
% 0.18/0.50 thf(f214,axiom,(
% 0.18/0.50 (all_of @ (^[X0 : $i] : (in @ X0 @ nat)) @ (^[X0 : $i] : (all_of @ (^[X1 : $i] : (in @ X1 @ nat)) @ (^[X1 : $i] : ((d_29_ii @ X0 @ X1) => (iii @ X1 @ X0))))))),
% 0.18/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz11)).
% 0.18/0.50 thf(f689,plain,(
% 0.18/0.50 ($true = (is_of @ sK2 @ (^[Y0 : $i]: (in @ Y0 @ nat))))),
% 0.18/0.50 inference(binary_proxy_clausification,[],[f687])).
% 0.18/0.50 thf(f693,plain,(
% 0.18/0.50 ($true = (is_of @ sK3 @ (^[Y0 : $i]: (in @ Y0 @ nat))))),
% 0.18/0.50 inference(binary_proxy_clausification,[],[f691])).
% 0.18/0.50 thf(f1143,plain,(
% 0.18/0.50 ($true = (n_is @ sK3 @ sK2)) | ((n_some @ (diffprop @ sK3 @ sK2)) = $true)),
% 0.18/0.50 inference(trivial_inequality_removal,[],[f1142])).
% 0.18/0.50 thf(f1142,plain,(
% 0.18/0.50 ($true = (n_is @ sK3 @ sK2)) | ((n_some @ (diffprop @ sK3 @ sK2)) = $true) | ($true = $false)),
% 0.18/0.50 inference(forward_demodulation,[],[f1136,f1080])).
% 0.18/0.50 thf(f1080,plain,(
% 0.18/0.50 ($false = (iii @ sK3 @ sK2))),
% 0.18/0.50 inference(trivial_inequality_removal,[],[f1079])).
% 0.18/0.50 thf(f1079,plain,(
% 0.18/0.50 ($true = $false) | ($false = (iii @ sK3 @ sK2))),
% 0.18/0.50 inference(forward_demodulation,[],[f1068,f694])).
% 0.18/0.50 thf(f694,plain,(
% 0.18/0.50 ((n_some @ (diffprop @ sK2 @ sK3)) = $false)),
% 0.18/0.50 inference(binary_proxy_clausification,[],[f692])).
% 0.18/0.50 thf(f1068,plain,(
% 0.18/0.50 ($false = (iii @ sK3 @ sK2)) | ((n_some @ (diffprop @ sK2 @ sK3)) = $true)),
% 0.18/0.50 inference(trivial_inequality_removal,[],[f1065])).
% 0.18/0.50 thf(f1065,plain,(
% 0.18/0.50 ($true = $false) | ((n_some @ (diffprop @ sK2 @ sK3)) = $true) | ($false = (iii @ sK3 @ sK2))),
% 0.18/0.50 inference(superposition,[],[f693,f999])).
% 0.18/0.50 thf(f999,plain,(
% 0.18/0.50 ( ! [X0 : $i] : (((is_of @ X0 @ (^[Y0 : $i]: (in @ Y0 @ nat))) = $false) | ($true = (n_some @ (diffprop @ sK2 @ X0))) | ((iii @ X0 @ sK2) = $false)) )),
% 0.18/0.50 inference(trivial_inequality_removal,[],[f994])).
% 0.18/0.50 thf(f994,plain,(
% 0.18/0.50 ( ! [X0 : $i] : (((is_of @ X0 @ (^[Y0 : $i]: (in @ Y0 @ nat))) = $false) | ((iii @ X0 @ sK2) = $false) | ($true = (n_some @ (diffprop @ sK2 @ X0))) | ($true = $false)) )),
% 0.18/0.50 inference(superposition,[],[f895,f689])).
% 0.18/0.50 thf(f895,plain,(
% 0.18/0.50 ( ! [X2 : $i,X1 : $i] : (($false = (is_of @ X2 @ (^[Y0 : $i]: (in @ Y0 @ nat)))) | ($false = (is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat)))) | ((n_some @ (diffprop @ X2 @ X1)) = $true) | ($false = (iii @ X1 @ X2))) )),
% 0.18/0.50 inference(binary_proxy_clausification,[],[f894])).
% 0.18/0.50 thf(f894,plain,(
% 0.18/0.50 ( ! [X2 : $i,X1 : $i] : (($false = (is_of @ X2 @ (^[Y0 : $i]: (in @ Y0 @ nat)))) | ($false = (is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat)))) | (((iii @ X1 @ X2) => (n_some @ (diffprop @ X2 @ X1))) = $true)) )),
% 0.18/0.50 inference(binary_proxy_clausification,[],[f893])).
% 0.18/0.50 thf(f893,plain,(
% 0.18/0.50 ( ! [X2 : $i,X1 : $i] : ((((is_of @ X2 @ (^[Y0 : $i]: (in @ Y0 @ nat))) => ((iii @ X1 @ X2) => (n_some @ (diffprop @ X2 @ X1)))) = $true) | ($false = (is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat))))) )),
% 0.18/0.50 inference(beta_eta_normalization,[],[f892])).
% 0.18/0.50 thf(f892,plain,(
% 0.18/0.50 ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => ((iii @ X1 @ Y0) => (n_some @ (diffprop @ Y0 @ X1))))) @ X2) = $true) | ($false = (is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat))))) )),
% 0.18/0.50 inference(pi_clausification,[],[f891])).
% 0.18/0.50 thf(f891,plain,(
% 0.18/0.50 ( ! [X1 : $i] : (($false = (is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat)))) | ((!! @ $i @ (^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => ((iii @ X1 @ Y0) => (n_some @ (diffprop @ Y0 @ X1)))))) = $true)) )),
% 0.18/0.50 inference(binary_proxy_clausification,[],[f890])).
% 0.18/0.50 thf(f890,plain,(
% 0.18/0.50 ( ! [X1 : $i] : (($true = ((is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat))) => (!! @ $i @ (^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => ((iii @ X1 @ Y0) => (n_some @ (diffprop @ Y0 @ X1))))))))) )),
% 0.18/0.50 inference(beta_eta_normalization,[],[f889])).
% 0.18/0.50 thf(f889,plain,(
% 0.18/0.50 ( ! [X1 : $i] : ((((^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => (!! @ $i @ (^[Y1 : $i]: ((is_of @ Y1 @ (^[Y2 : $i]: (in @ Y2 @ nat))) => ((iii @ Y0 @ Y1) => (n_some @ (diffprop @ Y1 @ Y0)))))))) @ X1) = $true)) )),
% 0.18/0.50 inference(pi_clausification,[],[f888])).
% 0.18/0.50 thf(f888,plain,(
% 0.18/0.50 ($true = (!! @ $i @ (^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => (!! @ $i @ (^[Y1 : $i]: ((is_of @ Y1 @ (^[Y2 : $i]: (in @ Y2 @ nat))) => ((iii @ Y0 @ Y1) => (n_some @ (diffprop @ Y1 @ Y0))))))))))),
% 0.18/0.50 inference(beta_eta_normalization,[],[f656])).
% 0.18/0.50 thf(f656,plain,(
% 0.18/0.50 ($true = ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((is_of @ Y2 @ Y0) => (Y1 @ Y2))))))) @ (^[Y0 : $i]: (in @ Y0 @ nat)) @ (^[Y0 : $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: (!! @ $i @ (^[Y3 : $i]: ((is_of @ Y3 @ Y1) => (Y2 @ Y3))))))) @ (^[Y1 : $i]: (in @ Y1 @ nat)) @ (^[Y1 : $i]: ((iii @ Y0 @ Y1) => ((^[Y2 : $i]: ((^[Y3 : $i]: (n_some @ (diffprop @ Y2 @ Y3))))) @ Y1 @ Y0)))))))),
% 0.18/0.50 inference(definition_unfolding,[],[f604,f567,f567,f602])).
% 0.18/0.50 thf(f604,plain,(
% 0.18/0.50 ((all_of @ (^[Y0 : $i]: (in @ Y0 @ nat)) @ (^[Y0 : $i]: (all_of @ (^[Y1 : $i]: (in @ Y1 @ nat)) @ (^[Y1 : $i]: ((iii @ Y0 @ Y1) => (d_29_ii @ Y1 @ Y0)))))) = $true)),
% 0.18/0.50 inference(cnf_transformation,[],[f432])).
% 0.18/0.50 thf(f432,plain,(
% 0.18/0.50 ((all_of @ (^[Y0 : $i]: (in @ Y0 @ nat)) @ (^[Y0 : $i]: (all_of @ (^[Y1 : $i]: (in @ Y1 @ nat)) @ (^[Y1 : $i]: ((iii @ Y0 @ Y1) => (d_29_ii @ Y1 @ Y0)))))) = $true)),
% 0.18/0.50 inference(fool_elimination,[],[f431])).
% 0.18/0.50 thf(f431,plain,(
% 0.18/0.50 (all_of @ (^[X0 : $i] : (in @ X0 @ nat)) @ (^[X1 : $i] : (all_of @ (^[X2 : $i] : (in @ X2 @ nat)) @ (^[X3 : $i] : ((iii @ X1 @ X3) => (d_29_ii @ X3 @ X1))))))),
% 0.18/0.50 inference(rectify,[],[f215])).
% 0.18/0.50 thf(f215,axiom,(
% 0.18/0.50 (all_of @ (^[X0 : $i] : (in @ X0 @ nat)) @ (^[X0 : $i] : (all_of @ (^[X1 : $i] : (in @ X1 @ nat)) @ (^[X1 : $i] : ((iii @ X0 @ X1) => (d_29_ii @ X1 @ X0))))))),
% 0.18/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz12)).
% 0.18/0.50 thf(f1136,plain,(
% 0.18/0.50 ($true = (iii @ sK3 @ sK2)) | ((n_some @ (diffprop @ sK3 @ sK2)) = $true) | ($true = (n_is @ sK3 @ sK2))),
% 0.18/0.50 inference(trivial_inequality_removal,[],[f1131])).
% 0.18/0.50 thf(f1131,plain,(
% 0.18/0.50 ((n_some @ (diffprop @ sK3 @ sK2)) = $true) | ($true = $false) | ($true = (n_is @ sK3 @ sK2)) | ($true = (iii @ sK3 @ sK2))),
% 0.18/0.50 inference(superposition,[],[f1010,f693])).
% 0.18/0.50 thf(f1010,plain,(
% 0.18/0.50 ( ! [X0 : $i] : (((is_of @ X0 @ (^[Y0 : $i]: (in @ Y0 @ nat))) = $false) | ((n_is @ X0 @ sK2) = $true) | ((iii @ X0 @ sK2) = $true) | ($true = (n_some @ (diffprop @ X0 @ sK2)))) )),
% 0.18/0.50 inference(trivial_inequality_removal,[],[f1006])).
% 0.18/0.50 thf(f1006,plain,(
% 0.18/0.50 ( ! [X0 : $i] : (($true = $false) | ((n_is @ X0 @ sK2) = $true) | ($true = (n_some @ (diffprop @ X0 @ sK2))) | ((iii @ X0 @ sK2) = $true) | ((is_of @ X0 @ (^[Y0 : $i]: (in @ Y0 @ nat))) = $false)) )),
% 0.18/0.50 inference(superposition,[],[f882,f689])).
% 0.18/0.50 thf(f882,plain,(
% 0.18/0.50 ( ! [X2 : $i,X1 : $i] : (($false = (is_of @ X2 @ (^[Y0 : $i]: (in @ Y0 @ nat)))) | ($true = (iii @ X1 @ X2)) | ($false = (is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat)))) | ($true = (n_some @ (diffprop @ X1 @ X2))) | ((n_is @ X1 @ X2) = $true)) )),
% 0.18/0.50 inference(not_proxy_clausification,[],[f881])).
% 0.18/0.50 thf(f881,plain,(
% 0.18/0.50 ( ! [X2 : $i,X1 : $i] : (($false = (is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat)))) | ($false = (~ (iii @ X1 @ X2))) | ((n_is @ X1 @ X2) = $true) | ($false = (is_of @ X2 @ (^[Y0 : $i]: (in @ Y0 @ nat)))) | ($true = (n_some @ (diffprop @ X1 @ X2)))) )),
% 0.18/0.50 inference(binary_proxy_clausification,[],[f880])).
% 0.18/0.50 thf(f880,plain,(
% 0.18/0.50 ( ! [X2 : $i,X1 : $i] : ((((~ (iii @ X1 @ X2)) => (n_is @ X1 @ X2)) = $true) | ($false = (is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat)))) | ($true = (n_some @ (diffprop @ X1 @ X2))) | ($false = (is_of @ X2 @ (^[Y0 : $i]: (in @ Y0 @ nat))))) )),
% 0.18/0.50 inference(not_proxy_clausification,[],[f879])).
% 0.18/0.50 thf(f879,plain,(
% 0.18/0.50 ( ! [X2 : $i,X1 : $i] : (($false = (is_of @ X2 @ (^[Y0 : $i]: (in @ Y0 @ nat)))) | ($false = (~ (n_some @ (diffprop @ X1 @ X2)))) | (((~ (iii @ X1 @ X2)) => (n_is @ X1 @ X2)) = $true) | ($false = (is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat))))) )),
% 0.18/0.50 inference(binary_proxy_clausification,[],[f878])).
% 0.18/0.50 thf(f878,plain,(
% 0.18/0.50 ( ! [X2 : $i,X1 : $i] : (($true = ((~ (n_some @ (diffprop @ X1 @ X2))) => ((~ (iii @ X1 @ X2)) => (n_is @ X1 @ X2)))) | ($false = (is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat)))) | ($false = (is_of @ X2 @ (^[Y0 : $i]: (in @ Y0 @ nat))))) )),
% 0.18/0.50 inference(binary_proxy_clausification,[],[f877])).
% 0.18/0.50 thf(f877,plain,(
% 0.18/0.50 ( ! [X2 : $i,X1 : $i] : (($true = ((is_of @ X2 @ (^[Y0 : $i]: (in @ Y0 @ nat))) => ((~ (n_some @ (diffprop @ X1 @ X2))) => ((~ (iii @ X1 @ X2)) => (n_is @ X1 @ X2))))) | ($false = (is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat))))) )),
% 0.18/0.50 inference(beta_eta_normalization,[],[f876])).
% 0.18/0.50 thf(f876,plain,(
% 0.18/0.50 ( ! [X2 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => ((~ (n_some @ (diffprop @ X1 @ Y0))) => ((~ (iii @ X1 @ Y0)) => (n_is @ X1 @ Y0))))) @ X2)) | ($false = (is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat))))) )),
% 0.18/0.50 inference(pi_clausification,[],[f875])).
% 0.18/0.50 thf(f875,plain,(
% 0.18/0.50 ( ! [X1 : $i] : (($false = (is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat)))) | ((!! @ $i @ (^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => ((~ (n_some @ (diffprop @ X1 @ Y0))) => ((~ (iii @ X1 @ Y0)) => (n_is @ X1 @ Y0)))))) = $true)) )),
% 0.18/0.50 inference(binary_proxy_clausification,[],[f874])).
% 0.18/0.50 thf(f874,plain,(
% 0.18/0.50 ( ! [X1 : $i] : (($true = ((is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat))) => (!! @ $i @ (^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => ((~ (n_some @ (diffprop @ X1 @ Y0))) => ((~ (iii @ X1 @ Y0)) => (n_is @ X1 @ Y0))))))))) )),
% 0.18/0.50 inference(beta_eta_normalization,[],[f873])).
% 0.18/0.50 thf(f873,plain,(
% 0.18/0.50 ( ! [X1 : $i] : ((((^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => (!! @ $i @ (^[Y1 : $i]: ((is_of @ Y1 @ (^[Y2 : $i]: (in @ Y2 @ nat))) => ((~ (n_some @ (diffprop @ Y0 @ Y1))) => ((~ (iii @ Y0 @ Y1)) => (n_is @ Y0 @ Y1)))))))) @ X1) = $true)) )),
% 0.18/0.50 inference(pi_clausification,[],[f872])).
% 0.18/0.50 thf(f872,plain,(
% 0.18/0.50 ($true = (!! @ $i @ (^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => (!! @ $i @ (^[Y1 : $i]: ((is_of @ Y1 @ (^[Y2 : $i]: (in @ Y2 @ nat))) => ((~ (n_some @ (diffprop @ Y0 @ Y1))) => ((~ (iii @ Y0 @ Y1)) => (n_is @ Y0 @ Y1))))))))))),
% 0.18/0.50 inference(boolean_simplification,[],[f871])).
% 0.18/0.50 thf(f871,plain,(
% 0.18/0.50 ($true = (!! @ $i @ (^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => (!! @ $i @ (^[Y1 : $i]: ((is_of @ Y1 @ (^[Y2 : $i]: (in @ Y2 @ nat))) => (((n_some @ (diffprop @ Y0 @ Y1)) => $false) => ((~ (iii @ Y0 @ Y1)) => (n_is @ Y0 @ Y1))))))))))),
% 0.18/0.50 inference(boolean_simplification,[],[f870])).
% 0.18/0.50 thf(f870,plain,(
% 0.18/0.50 ((!! @ $i @ (^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => (!! @ $i @ (^[Y1 : $i]: ((is_of @ Y1 @ (^[Y2 : $i]: (in @ Y2 @ nat))) => (((n_some @ (diffprop @ Y0 @ Y1)) => $false) => (((iii @ Y0 @ Y1) => $false) => (n_is @ Y0 @ Y1))))))))) = $true)),
% 0.18/0.50 inference(beta_eta_normalization,[],[f640])).
% 0.18/0.50 thf(f640,plain,(
% 0.18/0.50 ($true = ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((is_of @ Y2 @ Y0) => (Y1 @ Y2))))))) @ (^[Y0 : $i]: (in @ Y0 @ nat)) @ (^[Y0 : $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: (!! @ $i @ (^[Y3 : $i]: ((is_of @ Y3 @ Y1) => (Y2 @ Y3))))))) @ (^[Y1 : $i]: (in @ Y1 @ nat)) @ (^[Y1 : $i]: (((^[Y2 : $o]: ((^[Y3 : $o]: ((^[Y4 : $o]: (Y3 => Y4)))) @ Y2 @ $false)) @ ((^[Y2 : $i]: ((^[Y3 : $i]: (n_some @ (diffprop @ Y2 @ Y3))))) @ Y0 @ Y1)) => ((^[Y2 : $i]: ((^[Y3 : $i]: ((^[Y4 : $o]: ((^[Y5 : $o]: ((^[Y6 : $o]: (Y5 => Y6)))) @ ((^[Y5 : $o]: ((^[Y6 : $o]: ((^[Y7 : $o]: (Y6 => Y7)))) @ Y5 @ $false)) @ Y4))) @ (iii @ Y2 @ Y3) @ (n_is @ Y2 @ Y3))))) @ Y0 @ Y1)))))))),
% 0.18/0.50 inference(definition_unfolding,[],[f566,f567,f567,f624,f602,f627])).
% 0.18/0.50 thf(f566,plain,(
% 0.18/0.50 ($true = (all_of @ (^[Y0 : $i]: (in @ Y0 @ nat)) @ (^[Y0 : $i]: (all_of @ (^[Y1 : $i]: (in @ Y1 @ nat)) @ (^[Y1 : $i]: ((d_not @ (d_29_ii @ Y0 @ Y1)) => (lessis @ Y0 @ Y1)))))))),
% 0.18/0.50 inference(cnf_transformation,[],[f281])).
% 0.18/0.50 thf(f281,plain,(
% 0.18/0.50 ($true = (all_of @ (^[Y0 : $i]: (in @ Y0 @ nat)) @ (^[Y0 : $i]: (all_of @ (^[Y1 : $i]: (in @ Y1 @ nat)) @ (^[Y1 : $i]: ((d_not @ (d_29_ii @ Y0 @ Y1)) => (lessis @ Y0 @ Y1)))))))),
% 0.18/0.50 inference(fool_elimination,[],[f280])).
% 0.18/0.50 thf(f280,plain,(
% 0.18/0.50 (all_of @ (^[X0 : $i] : (in @ X0 @ nat)) @ (^[X1 : $i] : (all_of @ (^[X2 : $i] : (in @ X2 @ nat)) @ (^[X3 : $i] : ((d_not @ (d_29_ii @ X1 @ X3)) => (lessis @ X1 @ X3))))))),
% 0.18/0.50 inference(rectify,[],[f222])).
% 0.18/0.50 thf(f222,axiom,(
% 0.18/0.50 (all_of @ (^[X0 : $i] : (in @ X0 @ nat)) @ (^[X0 : $i] : (all_of @ (^[X1 : $i] : (in @ X1 @ nat)) @ (^[X1 : $i] : ((d_not @ (d_29_ii @ X0 @ X1)) => (lessis @ X0 @ X1))))))),
% 0.18/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz10e)).
% 0.18/0.50 thf(f1275,plain,(
% 0.18/0.50 ($false = (n_is @ sK3 @ sK2)) | ($true = (iii @ sK2 @ sK3)) | ($true = (n_is @ sK2 @ sK3))),
% 0.18/0.50 inference(trivial_inequality_removal,[],[f1269])).
% 0.18/0.50 thf(f1269,plain,(
% 0.18/0.50 ($true = (n_is @ sK2 @ sK3)) | ($false = (n_is @ sK3 @ sK2)) | ($true = (iii @ sK2 @ sK3)) | ($true = $false)),
% 0.18/0.50 inference(superposition,[],[f1172,f693])).
% 0.18/0.50 thf(f1172,plain,(
% 0.18/0.50 ( ! [X0 : $i] : (((is_of @ X0 @ (^[Y0 : $i]: (in @ Y0 @ nat))) = $false) | ($true = (iii @ sK2 @ X0)) | ((n_is @ X0 @ sK2) = $false) | ($true = (n_is @ sK2 @ X0))) )),
% 0.18/0.50 inference(trivial_inequality_removal,[],[f1166])).
% 0.18/0.50 thf(f1166,plain,(
% 0.18/0.50 ( ! [X0 : $i] : (((n_is @ X0 @ sK2) = $false) | ($true = (n_is @ sK2 @ X0)) | ($true = (iii @ sK2 @ X0)) | ((is_of @ X0 @ (^[Y0 : $i]: (in @ Y0 @ nat))) = $false) | ($true = $false)) )),
% 0.18/0.50 inference(superposition,[],[f689,f820])).
% 0.18/0.50 thf(f820,plain,(
% 0.18/0.50 ( ! [X2 : $i,X1 : $i] : (($false = (is_of @ X2 @ (^[Y0 : $i]: (in @ Y0 @ nat)))) | ($true = (iii @ X2 @ X1)) | ($false = (is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat)))) | ($true = (n_is @ X2 @ X1)) | ((n_is @ X1 @ X2) = $false)) )),
% 0.18/0.50 inference(not_proxy_clausification,[],[f816])).
% 0.18/0.50 thf(f816,plain,(
% 0.18/0.50 ( ! [X2 : $i,X1 : $i] : (($false = (is_of @ X2 @ (^[Y0 : $i]: (in @ Y0 @ nat)))) | ((n_is @ X1 @ X2) = $false) | ($false = (is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat)))) | ((~ (iii @ X2 @ X1)) = $false) | ($true = (n_is @ X2 @ X1))) )),
% 0.18/0.50 inference(binary_proxy_clausification,[],[f815])).
% 0.18/0.50 thf(f815,plain,(
% 0.18/0.50 ( ! [X2 : $i,X1 : $i] : (($false = (is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat)))) | (((~ (n_some @ (diffprop @ X1 @ X2))) => (n_is @ X1 @ X2)) = $false) | ((~ (iii @ X2 @ X1)) = $false) | ($true = (n_is @ X2 @ X1)) | ($false = (is_of @ X2 @ (^[Y0 : $i]: (in @ Y0 @ nat))))) )),
% 0.18/0.50 inference(binary_proxy_clausification,[],[f814])).
% 0.18/0.50 thf(f814,plain,(
% 0.18/0.50 ( ! [X2 : $i,X1 : $i] : (($true = ((~ (iii @ X2 @ X1)) => (n_is @ X2 @ X1))) | (((~ (n_some @ (diffprop @ X1 @ X2))) => (n_is @ X1 @ X2)) = $false) | ($false = (is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat)))) | ($false = (is_of @ X2 @ (^[Y0 : $i]: (in @ Y0 @ nat))))) )),
% 0.18/0.50 inference(binary_proxy_clausification,[],[f813])).
% 0.18/0.50 thf(f813,plain,(
% 0.18/0.50 ( ! [X2 : $i,X1 : $i] : (($true = (((~ (n_some @ (diffprop @ X1 @ X2))) => (n_is @ X1 @ X2)) => ((~ (iii @ X2 @ X1)) => (n_is @ X2 @ X1)))) | ($false = (is_of @ X2 @ (^[Y0 : $i]: (in @ Y0 @ nat)))) | ($false = (is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat))))) )),
% 0.18/0.50 inference(binary_proxy_clausification,[],[f812])).
% 0.18/0.50 thf(f812,plain,(
% 0.18/0.50 ( ! [X2 : $i,X1 : $i] : (($false = (is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat)))) | ($true = ((is_of @ X2 @ (^[Y0 : $i]: (in @ Y0 @ nat))) => (((~ (n_some @ (diffprop @ X1 @ X2))) => (n_is @ X1 @ X2)) => ((~ (iii @ X2 @ X1)) => (n_is @ X2 @ X1)))))) )),
% 0.18/0.50 inference(beta_eta_normalization,[],[f811])).
% 0.18/0.50 thf(f811,plain,(
% 0.18/0.50 ( ! [X2 : $i,X1 : $i] : (($true = ((^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => (((~ (n_some @ (diffprop @ X1 @ Y0))) => (n_is @ X1 @ Y0)) => ((~ (iii @ Y0 @ X1)) => (n_is @ Y0 @ X1))))) @ X2)) | ($false = (is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat))))) )),
% 0.18/0.50 inference(pi_clausification,[],[f810])).
% 0.18/0.50 thf(f810,plain,(
% 0.18/0.50 ( ! [X1 : $i] : (($false = (is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat)))) | ($true = (!! @ $i @ (^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => (((~ (n_some @ (diffprop @ X1 @ Y0))) => (n_is @ X1 @ Y0)) => ((~ (iii @ Y0 @ X1)) => (n_is @ Y0 @ X1)))))))) )),
% 0.18/0.50 inference(binary_proxy_clausification,[],[f809])).
% 0.18/0.50 thf(f809,plain,(
% 0.18/0.50 ( ! [X1 : $i] : ((((is_of @ X1 @ (^[Y0 : $i]: (in @ Y0 @ nat))) => (!! @ $i @ (^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => (((~ (n_some @ (diffprop @ X1 @ Y0))) => (n_is @ X1 @ Y0)) => ((~ (iii @ Y0 @ X1)) => (n_is @ Y0 @ X1))))))) = $true)) )),
% 0.18/0.50 inference(beta_eta_normalization,[],[f808])).
% 0.18/0.50 thf(f808,plain,(
% 0.18/0.50 ( ! [X1 : $i] : (($true = ((^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => (!! @ $i @ (^[Y1 : $i]: ((is_of @ Y1 @ (^[Y2 : $i]: (in @ Y2 @ nat))) => (((~ (n_some @ (diffprop @ Y0 @ Y1))) => (n_is @ Y0 @ Y1)) => ((~ (iii @ Y1 @ Y0)) => (n_is @ Y1 @ Y0)))))))) @ X1))) )),
% 0.18/0.50 inference(pi_clausification,[],[f807])).
% 0.18/0.50 thf(f807,plain,(
% 0.18/0.50 ($true = (!! @ $i @ (^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => (!! @ $i @ (^[Y1 : $i]: ((is_of @ Y1 @ (^[Y2 : $i]: (in @ Y2 @ nat))) => (((~ (n_some @ (diffprop @ Y0 @ Y1))) => (n_is @ Y0 @ Y1)) => ((~ (iii @ Y1 @ Y0)) => (n_is @ Y1 @ Y0))))))))))),
% 0.18/0.50 inference(boolean_simplification,[],[f806])).
% 0.18/0.50 thf(f806,plain,(
% 0.18/0.50 ($true = (!! @ $i @ (^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => (!! @ $i @ (^[Y1 : $i]: ((is_of @ Y1 @ (^[Y2 : $i]: (in @ Y2 @ nat))) => ((((n_some @ (diffprop @ Y0 @ Y1)) => $false) => (n_is @ Y0 @ Y1)) => ((~ (iii @ Y1 @ Y0)) => (n_is @ Y1 @ Y0))))))))))),
% 0.18/0.50 inference(boolean_simplification,[],[f805])).
% 0.18/0.50 thf(f805,plain,(
% 0.18/0.50 ($true = (!! @ $i @ (^[Y0 : $i]: ((is_of @ Y0 @ (^[Y1 : $i]: (in @ Y1 @ nat))) => (!! @ $i @ (^[Y1 : $i]: ((is_of @ Y1 @ (^[Y2 : $i]: (in @ Y2 @ nat))) => ((((n_some @ (diffprop @ Y0 @ Y1)) => $false) => (n_is @ Y0 @ Y1)) => (((iii @ Y1 @ Y0) => $false) => (n_is @ Y1 @ Y0))))))))))),
% 0.18/0.50 inference(beta_eta_normalization,[],[f657])).
% 0.18/0.50 thf(f657,plain,(
% 0.18/0.50 ($true = ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: (!! @ $i @ (^[Y2 : $i]: ((is_of @ Y2 @ Y0) => (Y1 @ Y2))))))) @ (^[Y0 : $i]: (in @ Y0 @ nat)) @ (^[Y0 : $i]: ((^[Y1 : $i > $o]: ((^[Y2 : $i > $o]: (!! @ $i @ (^[Y3 : $i]: ((is_of @ Y3 @ Y1) => (Y2 @ Y3))))))) @ (^[Y1 : $i]: (in @ Y1 @ nat)) @ (^[Y1 : $i]: (((^[Y2 : $i]: ((^[Y3 : $i]: ((^[Y4 : $o]: ((^[Y5 : $o]: ((^[Y6 : $o]: (Y5 => Y6)))) @ ((^[Y5 : $o]: ((^[Y6 : $o]: ((^[Y7 : $o]: (Y6 => Y7)))) @ Y5 @ $false)) @ Y4))) @ ((^[Y4 : $i]: ((^[Y5 : $i]: (n_some @ (diffprop @ Y4 @ Y5))))) @ Y2 @ Y3) @ (n_is @ Y2 @ Y3))))) @ Y0 @ Y1) => ((^[Y2 : $i]: ((^[Y3 : $i]: ((^[Y4 : $o]: ((^[Y5 : $o]: ((^[Y6 : $o]: (Y5 => Y6)))) @ ((^[Y5 : $o]: ((^[Y6 : $o]: ((^[Y7 : $o]: (Y6 => Y7)))) @ Y5 @ $false)) @ Y4))) @ (iii @ Y2 @ Y3) @ (n_is @ Y2 @ Y3))))) @ Y1 @ Y0)))))))),
% 0.18/0.50 inference(definition_unfolding,[],[f605,f567,f567,f626,f627])).
% 0.18/0.50 thf(f626,plain,(
% 0.18/0.50 (moreis = (^[Y0 : $i]: ((^[Y1 : $i]: ((^[Y2 : $o]: ((^[Y3 : $o]: ((^[Y4 : $o]: (Y3 => Y4)))) @ ((^[Y3 : $o]: ((^[Y4 : $o]: ((^[Y5 : $o]: (Y4 => Y5)))) @ Y3 @ $false)) @ Y2))) @ ((^[Y2 : $i]: ((^[Y3 : $i]: (n_some @ (diffprop @ Y2 @ Y3))))) @ Y0 @ Y1) @ (n_is @ Y0 @ Y1))))))),
% 0.18/0.50 inference(definition_unfolding,[],[f569,f625,f602])).
% 0.18/0.50 thf(f569,plain,(
% 0.18/0.50 (moreis = (^[Y0 : $i]: ((^[Y1 : $i]: (l_or @ (d_29_ii @ Y0 @ Y1) @ (n_is @ Y0 @ Y1))))))),
% 0.18/0.50 inference(cnf_transformation,[],[f558])).
% 0.18/0.50 thf(f558,plain,(
% 0.18/0.50 (moreis = (^[Y0 : $i]: ((^[Y1 : $i]: (l_or @ (d_29_ii @ Y0 @ Y1) @ (n_is @ Y0 @ Y1))))))),
% 0.18/0.50 inference(fool_elimination,[],[f216])).
% 0.18/0.50 thf(f216,axiom,(
% 0.18/0.50 (moreis = (^[X0 : $i, X1 : $i] : (l_or @ (d_29_ii @ X0 @ X1) @ (n_is @ X0 @ X1))))),
% 0.18/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p',def_moreis)).
% 0.18/0.50 thf(f605,plain,(
% 0.18/0.50 ((all_of @ (^[Y0 : $i]: (in @ Y0 @ nat)) @ (^[Y0 : $i]: (all_of @ (^[Y1 : $i]: (in @ Y1 @ nat)) @ (^[Y1 : $i]: ((moreis @ Y0 @ Y1) => (lessis @ Y1 @ Y0)))))) = $true)),
% 0.18/0.50 inference(cnf_transformation,[],[f480])).
% 0.18/0.50 thf(f480,plain,(
% 0.18/0.50 ((all_of @ (^[Y0 : $i]: (in @ Y0 @ nat)) @ (^[Y0 : $i]: (all_of @ (^[Y1 : $i]: (in @ Y1 @ nat)) @ (^[Y1 : $i]: ((moreis @ Y0 @ Y1) => (lessis @ Y1 @ Y0)))))) = $true)),
% 0.18/0.50 inference(fool_elimination,[],[f479])).
% 0.18/0.50 thf(f479,plain,(
% 0.18/0.50 (all_of @ (^[X0 : $i] : (in @ X0 @ nat)) @ (^[X1 : $i] : (all_of @ (^[X2 : $i] : (in @ X2 @ nat)) @ (^[X3 : $i] : ((moreis @ X1 @ X3) => (lessis @ X3 @ X1))))))),
% 0.18/0.50 inference(rectify,[],[f218])).
% 0.18/0.50 thf(f218,axiom,(
% 0.18/0.50 (all_of @ (^[X0 : $i] : (in @ X0 @ nat)) @ (^[X0 : $i] : (all_of @ (^[X1 : $i] : (in @ X1 @ nat)) @ (^[X1 : $i] : ((moreis @ X0 @ X1) => (lessis @ X1 @ X0))))))),
% 0.18/0.50 file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz13)).
% 0.18/0.50 % SZS output end Proof for theBenchmark
% 0.18/0.50 % (30925)------------------------------
% 0.18/0.50 % (30925)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.18/0.50 % (30925)Termination reason: Refutation
% 0.18/0.50
% 0.18/0.50 % (30925)Memory used [KB]: 6652
% 0.18/0.50 % (30925)Time elapsed: 0.078 s
% 0.18/0.50 % (30925)Instructions burned: 157 (million)
% 0.18/0.50 % (30925)------------------------------
% 0.18/0.50 % (30925)------------------------------
% 0.18/0.50 % (30895)Success in time 0.17 s
% 0.18/0.50 % Vampire---4.8 exiting
%------------------------------------------------------------------------------